home *** CD-ROM | disk | FTP | other *** search
- Path: cityscape.co.uk!usenet
- From: pjs@bcs.org.uk (Peter J Seymour)
- Newsgroups: comp.lang.rexx
- Subject: Re: QSORT in REXX
- Date: 1 Jan 1996 20:01:33 GMT
- Organization: IP-GOLD User
- Distribution: inet
- Message-ID: <4c9eit$cga@news.cityscape.co.uk>
- References: <4c0hog$qov@newsbf02.news.aol.com>
- NNTP-Posting-Host: cisew61.demon.co.uk
- X-Newsreader: WinVN 0.92.6+
-
- In article <4c0hog$qov@newsbf02.news.aol.com>, blakeae@aol.com (BlakeAE) says:
- >
- >Does anyone have an example of how to use the Quick Sort algorithm in a
- >REXX exec? If so please post an example.
- >
- Interesting point about quicksort. I've experimented with several sorts
- in Rexx and I can't get quicksort to work reliably - it often leaves
- isolated items out of sequence. The fastest technique in rexx that I
- have found is an insertion sort. I suspect this is because of its
- short code path compared with the others and that code path length is
- an important consideration in an interpretated language.
-
- Am I addressing the right question?
-